Complementation in Multiset Theory
نویسندگان
چکیده
The paper delineates the problem related to difference and complementation in Multiset Theory. It is shown that none of the existing approaches succeeds in resolving the attendant difficulties without assuming some contrived stipulations. Mathematics Subject Classifications: 03E15, 03E20, 03E30
منابع مشابه
REDUNDANCY OF MULTISET TOPOLOGICAL SPACES
In this paper, we show the redundancies of multiset topological spaces. It is proved that $(P^star(U),sqsubseteq)$ and $(Ds(varphi(U)),subseteq)$ are isomorphic. It follows that multiset topological spaces are superfluous and unnecessary in the theoretical view point.
متن کاملOn fuzzy multiset regular grammars
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...
متن کاملTopological approximations of multisets
athemat s.2012.1 Abstract Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we define and investigate three types of lower and upper multiset approximations of any multiset. These types based on the multiset bas...
متن کاملReading 12 : Graphs
Graphs are discrete structures that model relationships between objects. Graphs play an important role in many areas of computer science. In this reading we introduce basic notions of graph theory that are important in computer science. In particular we look directed graphs, undirected graphs, trees and some applications of graphs. We begin by discussing directed graphs, also known as digraphs....
متن کاملOn multiset colorings of graphs
A vertex coloring of a graph G is a multiset coloring if the multisets of colors of the neighbors of every two adjacent vertices are different. The minimum k for which G has a multiset k-coloring is the multiset chromatic number χm(G) of G. For every graph G, χm(G) is bounded above by its chromatic number χ(G). The multiset chromatic numbers of regular graphs are investigated. It is shown that ...
متن کامل